THYEH. 2000/3/1. 14:58. Page 1/39. Competitive Analysis of Oblivious Routing on Hyper ubes
نویسندگان
چکیده
منابع مشابه
On a New Competitive Measure for Oblivious Routing
Oblivious routing algorithms use only locally available information at network nodes to forward traffic, and as such, a plausible choice for distributed implementations. It is a natural desire to quantify the performance penalty we pay for this distributedness. Recently, Räcke has shown that for general undirected graphs the competitive ratio is only , that is, the maximum congestion caused by ...
متن کاملOn Some Classes of Functions and Hypercubes
X iv :0 81 2. 43 67 v1 [ cs .D M ] 2 3 D ec 2 00 8 ON SOME CLASSES OF FUNCTIONS AND HYPERCUBES DIMITER STOICHKOV KOVACHEV Abstra t. In this paper, some lasses of dis rete fun tions of k-valued logi are onsidered, that depend on sets of their variables in a parti ular way. Obtained results allow to " onstru t" these fun tions and to present them in their tabular, analyti al or matrix form, that ...
متن کاملA Lower Bound for Oblivious Dimensional Routing
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends only on the source and destination node of the packet. Furthermore packets use a shortest path with a minimal number of bends. We present an Ω(kn(d+1)/2) step lower bound for oblivious dimensional k-k routing algorithms...
متن کاملOnline Packet Admission and Oblivious Routing in Sensor Networks
The concept of Oblivious Routing for general undirected networks was introduced by Räcke [12] when he showed that there exists an oblivious routing algorithm with polylogarithmic competitive ratio (w.r.t. edge congestion) for any undirected graph. In a following result, Räcke and Rosén [13] presented admission control algorithms achieving a polylogarithmic fraction (in the size of the network) ...
متن کاملLimited bookmark randomized online algorithms for the paging problem
An efficient randomized online algorithm for the paging problem for cache size 2 is given, which is 2 -competitive against an oblivious adversary. The algorithm keeps track of at most one page in slow memory at any time. A lower bound of 37 24 ≈ 1.5416 is given for the competitiveness of any trackless online algorithm for the same problem, i.e., an algorithm that keeps track of no page outside ...
متن کامل